Level Rings Arising from Meet-Distributive Meet-Semilattices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Level Rings Arising from Meet-distributive Meet-semilattices

The Alexander dual of an arbitrary meet-semilattice is described explicitly. Meet-distributive meet-semilattices whose Alexander dual is level are characterized.

متن کامل

Priestley Style Duality for Distributive Meet-semilattices

We generalize Priestley duality for distributive lattices to a duality for distributive meet-semilattices. On the one hand, our generalized Priestley spaces are easier to work with than Celani’s DS-spaces, and are similar to Hansoul’s Priestley structures. On the other hand, our generalized Priestley morphisms are similar to Celani’s meet-relations and are more general than Hansoul’s morphisms....

متن کامل

Note on Priestley-style Duality for Distributive Meet-semilattices

We carry out a detailed comparison of the two topological dualities for distributive meet-semilattices studied by Celani [3] and by Bezhanishvili and Jansana [2]. We carry out such comparison, that was already sketched in [2], by defining the functors involved in the equivalence of both dual categories of distributive meet-semilattices.

متن کامل

Coloring Of Meet-Semilattices

Given a commutative semigroup S with 0, where 0 is the unique singleton ideal, we associate a simple graph Γ(S), whose vertices are labeled with the nonzero elements in S. Two vertices in Γ(S) are adjacent if and only if the corresponding elements multiply to 0. The inverse problem, i.e., given an arbitrary simple graph, whether or not it can be associated to some commutative semigroup, has pro...

متن کامل

Quasi-concave functions on meet-semilattices

This paper deals with maximization of set f'unctions delined as minimum values of monotone linkage functions. In previous research, it has been shown that such a set function can be maximized by a greedy type algorithm over a family of all subsets of a finite set. ln this paper, we extend this finding to meet-semilattices. We show that the class of functions defined as minimum values of monoton...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nagoya Mathematical Journal

سال: 2006

ISSN: 0027-7630,2152-6842

DOI: 10.1017/s0027763000025654